Possible Attacks on and Countermeasures for Secure Multi-Agent Computation
نویسندگان
چکیده
In this paper we analyse a modified version of the model for secure mobile multi-agent computation proposed by Endsuleit and Mie [8]. The modified version still maintains tmax := dn3 e 1 as upper limit of tolerable corrupted agents. The original publication is lacking a security analysis that takes into account real world factors. This paper provides such an analysis. We analyse tmax looking at tmax under realistic network assumptions. We use an attack tree to identify possible attacks and discuss countermeasures. We also consider concrete examples for framework and Alliance sizes. In addition, we discuss different possibilities to improve Alliance security and to mitigate Denial-of-Service (DoS) attacks.
منابع مشابه
Higher-Order Glitches Free Implementation of the AES using Secure Multi-Party Computation Protocols
Higher-order side channel attacks (HO-SCA) is a powerful technique against cryptographic implementations and the design of appropriate countermeasures is nowadays an important topic. In parallel, another class of attacks, called glitches attacks, have been investigated which exploit the hardware glitches phenomena occurring during the physical execution of algorithms. Some solutions have been p...
متن کاملFault Resistant RSA Signatures: Chinese Remaindering in Both Directions
Fault attacks are one of the most severe attacks against secure embedded cryptographic implementations. Block ciphers such as AES, DES or public key algorithms such as RSA can be broken with as few as a single or a handful of erroneous computation results. Many countermeasures have been proposed both at the algorithmic level and using ad-hoc methods. In this paper, we address the problem of fin...
متن کاملSide Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is crucial to provide efficient and secure implementations of the pairings. There have been several works on efficient implementations of the pairings. However, the research for secure implementations of the pairings ha...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملRobust Node Positioning in Wireless Sensor Networks
Secure sensor localization is a prerequisite for many sensor networks to retrieve trustworthy data. However, most of existing node positioning systems were studied in trust environment and are therefore vulnerable to malicious attacks. In this work, we develop a robust node positioning mechanism(ROPM) to protect localization techniques from position attacks. Instead of introducing countermeasur...
متن کامل